On first-order definable colorings
نویسندگان
چکیده
We address the problem of characterizing H-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of structure.
منابع مشابه
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams
We discuss the completeness of an axiomatization of Monadic SecondOrder Logic (MSO) on infinite words (or streams). By using model-theoretic tools, we give an alternative proof of D. Siefkes’ result that a fragment with full comprehension and induction of second-order Peano’s arithmetic is complete w.r.t. the validity of MSO-formulas on streams. We rely on FefermanVaught Theorems and the Ehrenf...
متن کاملOn Counting Generalized Colorings
The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, as well as the matching polynomial, the cover polynomial and the various interlace polynomials fall into this category. In this paper we present a framework of graph polynomials based on counting functions of generalized colorin...
متن کاملDefinability and Compression
A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a different class K’ as output. Given a property P on the class K defined in a logicL, we study the definability of property P on the class K’. We consider two compression schemas on unary ordered structures (words), compression by runlength encoding and the classical Lempel-Ziv. First-orde...
متن کاملDescriptive Graph Combinatorics
In this article we survey the emerging field of descriptive graph combinatorics. This area has developed in the last two decades or so at the interface of descriptive set theory and graph theory, and it has interesting connections with other areas such as ergodic theory and probability theory. Our object of study is the theory of definable graphs, usually Borel or analytic graphs on Polish spac...
متن کاملTopologizing interpretable sets in O-minimal Structures
Let M be a structure in some language. Assume M has elimination of imaginaries. Let X be a definable set. Definable will mean “definable with parameters.” By a definable topology, we mean a definable family of subsets {By ⊂ X}y∈Y which form the basis for some topology on X. The fact that these form a basis for a topology amounts to the claim that if y1, y2 have By1 ∩By2 6= ∅, then for every x ∈...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014